Moufang loops of order coprime to three that cyclically extend groups of dihedral type
نویسندگان
چکیده
منابع مشابه
Moufang loops that are almost groups
It is known that Moufang loops are closely related to groups as they have many properties in common. For instance, they both have an inverse for each element and satisfy Lagrange’s theorem. In this paper, we study the properties of a class of Moufang loops which are not groups, but all their proper subloops and proper quotient loops are groups.
متن کاملMoufang Loops of Small Order
The main result of this paper is the determination of all nonassociative Moufang loops of orders *31. Combinatorial type methods are used to consider a number of cases which lead to the discovery of 13 loops of the type in question and prove that there can be no others. All of the loops found are isomorphic to all of their loop isotopes, are solvable, and satisfy both Lagrange's theorem and Syl...
متن کاملThe Moufang loops of order 64 and 81
We classify Moufang loops of order 64 and 81 up to isomorphism, using a linear algebraic approach to central loop extensions. In addition to the 267 groups of order 64, there are 4262 nonassociative Moufang loops of order 64. In addition to the 15 groups of order 81, there are 5 nonassociative Moufang loops of order 81, 2 of which are commutative.
متن کاملAutomorphism Groups of Simple Moufang Loops over Perfect Fields
Let F be a perfect field and M(F ) the nonassociative simple Moufang loop consisting of the units in the (unique) split octonion algebra O(F ) modulo the center. Then Aut(M(F )) is equal to G2(F )o Aut(F ). In particular, every automorphism of M(F ) is induced by a semilinear automorphism of O(F ). The proof combines results and methods from geometrical loop theory, groups of Lie type and compo...
متن کاملToward the classification of Moufang loops of order 64
We show how to obtain all nonassociative Moufang loops of order less than 64 and 4262 nonassociative Moufang loops of order 64 in a unified way. We conjecture that there are no other nonassociative Moufang loops of order 64. The main idea of the computer search is to modify precisely one quarter of the multiplication table in a certain way, previously applied to small
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Commentationes Mathematicae Universitatis Carolinae
سال: 2017
ISSN: 0010-2628,1213-7243
DOI: 10.14712/1213-7243.2015.187